Comparing SSALEO as a Scalable Large Scale Global Optimization Algorithm to High-Performance Algorithms for Real-World Constrained Optimization Benchmark
نویسندگان
چکیده
The Salp Swarm Algorithm (SSA) outperforms well-known algorithms such as particle swarm optimizers and grey wolf in complex optimization challenges. However, like most meta-heuristic algorithms, SSA suffers from slow convergence stagnation the best local solution. In this study, a algorithm is combined with escaping operator (LEO) to overcome some inherent limitations of original SSA. SSALEO novel search technique that accounts for population diversity, imbalance between exploitation exploration, algorithm’s premature convergence. By implementing LEO SSALEO, slowdown eliminated, efficiency agents improved. proposed method tested using CEC 2017 benchmark 50 100 decision variables, seven CEC2008lsgo test functions 200, 500, 1000 its performance was compared other metaheuristic (MAs) advanced including variants. comparisons show greatly benefits by enhancing quality accelerating solutions’ rate. then assessed set constrained design challenges various engineering domains defined 2020 conference benchmark. Friedman Wilcoxon rank-sum statistical tests are also used examine results. ACCORDING TO EXPERIMENTAL DATA AND STATISTICAL TESTS, very competitive often superior studies. Further, approach can be viewed special LSGO optimizer whose exceeds specialized state-of-the-art CMA-ES SHADE.
منابع مشابه
A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
A new method for the solution of minimization problems with simple bounds is presented. Global convergence of a general scheme requiring the approximate solution of a single linear system at each iteration is proved and a superlinear convergence rate is established without requiring the strict complementarity assumption. The algorithm proposed is based on a simple, smooth unconstrained reformul...
متن کاملA New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems
Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...
متن کاملSNOPT : An SQP Algorithm for Large - Scale Constrained Optimization ∗ Philip
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse. Second derivatives are assumed...
متن کاملSNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available and that the constraint gradients are sparse. We discuss an SQP algorithm th...
متن کاملPerformance Optimization for Large Scale Computing: The Scalable VAMPIR Approach
Performance optimization remains one of the key issues in parallel computing. Many parallel applications do not benefit from the continually increasing peak performance of todays massively parallel computers, mainly because they have not been designed to operate efficiently on the 1000s of processors of todays top of the range systems. Conventional performance analysis is typically restricted t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3202894